A Matrix Public Key Cryptosystem
نویسنده
چکیده
We discuss a matrix public key cryptosystem and its numerical implementation.
منابع مشابه
QTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملCryptanalysis of a Public Key Cryptosystem Based on the Matrix Combinatorial Problem
In this paper, we present a cryptanalysis of a public key cryptosystem based on the matrix combinatorial problem proposed by Wang and Hu (2010). Using lattice-based methods finding small integer solutions of modular linear equations, we recover the secret key of this cryptosystem for a certain range of parameters. In experiments, for the suggested parameters by Wang and Hu, the secret key can b...
متن کاملBreak Finite Automata Public Key Cryptosystem
In this paper we break a 10-year's standing public key cryptosystem, Finite Automata Public Key Cryptosystem(FAPKC for short). The security of FAPKC was mainly based on the di culty of nding a special common left factor of two given matrix polynomials. We prove a simple but previously unknown property of the input-memory nite automata. By this property, we reduce the basis of the FAPKC's securi...
متن کاملAttack on A New Public Key Cryptosystem from ISC'02 (LNCS 2433)
In ISC 2002, J. Zheng [8] proposed a new public key cryptosystem whose security is based upon the algebraic problem of reducing a high degree matrix to its canonical form by similarity transformations. In this paper, we show that factoring a polynomial over a finite field can be used to break down Zheng’s public key cryptosystem. The complexity of our attack is polynomial time. In other word, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1506.00277 شماره
صفحات -
تاریخ انتشار 2015